On the domination polynomial of a digraph: a generation function approach

Let G be a directed graph on n vertices. The domination polynomial of is the D(G, x) =∑ni=0 d(G, i)xi, where i) number dominating sets with i In this paper, we prove that can obtained by using an ordinary generating function. Besides, show our method useful to obtain minimum-weighted set graph.